SIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM

Authors

  • Fatemeh Taghvaee University of Kashan
Abstract:

Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$  and  $A(G)$ the adjacency matrix of $G$. The  signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of  graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper we first compute  the $k-$th signless Laplacian  spectral moments of a graph for small $k$  and then we order some graphs with respect to the signless Laplacian  spectral moments.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

signless laplacian spectral moments of graphs and ordering some graphs with respect to them

let $g = (v, e)$ be a simple graph. denote by $d(g)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$  and  $a(g)$ the adjacency matrix of $g$. the  signless laplacianmatrix of $g$ is $q(g) = d(g) + a(g)$ and the $k-$th signless laplacian spectral moment of  graph $g$ is defined as $t_k(g)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...

full text

THE SPECTRAL DETERMINATION OF THE MULTICONE GRAPHS Kw ▽ C WITH RESPECT TO THEIR SIGNLESS LAPLACIAN SPECTRA

The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let C and K w denote the Clebsch graph and a complete graph on w vertices, respectively. In this paper, we show that the multicone graphs K w ▽C are determined by their signless ...

full text

Ordering of the signless Laplacian spectral radii of unicyclic graphs

For n ≥ 11, we determine all the unicyclic graphs on n vertices whose signless Laplacian spectral radius is at least n− 2. There are exactly sixteen such graphs and they are ordered according to their signless Laplacian spectral radii.

full text

Seidel Signless Laplacian Energy of Graphs

Let $S(G)$ be the Seidel matrix of a graph $G$ of order $n$ and let $D_S(G)=diag(n-1-2d_1, n-1-2d_2,ldots, n-1-2d_n)$ be the diagonal matrix with $d_i$ denoting the degree of a vertex $v_i$ in $G$. The Seidel Laplacian matrix of $G$ is defined as $SL(G)=D_S(G)-S(G)$ and the Seidel signless Laplacian matrix as $SL^+(G)=D_S(G)+S(G)$. The Seidel signless Laplacian energy $E_{SL^+...

full text

On Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs

Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...

full text

On Spectrum of I-graphs and Its Ordering with Respect to Spectral Moments

Suppose G is a graph, A(G) its adjacency matrix, and μ1(G)≤ μ2(G) ≤ ·· · ≤ μn(G) are eigenvalues of A(G). The numbers Sk(G) = n ∑ i=1 μk i (G), 0 ≤ k ≤ n− 1 are said to be the k−th spectral moment of G and the sequence S(G) = (S0(G),S1(G), · · · ,Sn−1(G)) is called the spectral moments sequence of G. For two graphs G1 and G2, we define G1 ≺S G2, if there exists an integer k, 1≤ k≤ n−1, such tha...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 1  issue 2

pages  133- 141

publication date 2014-12-31

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023